北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (6): 120-124.doi: 10.13190/jbupt.200906.120.shut

• 研究报告 • 上一篇    下一篇

启发式探索的协议测试序列生成

舒挺;孙守迁;王海宁;徐伟强;李文书   

  1. (1.浙江大学 计算机科学与技术学院, 杭州 310027;
    2.浙江理工大学 信息电子学院, 杭州 310018)
  • 收稿日期:2009-04-14 修回日期:2009-10-21 出版日期:2009-12-28 发布日期:2009-12-28
  • 通讯作者: 舒挺

Test Sequence Generation of a Communication Protocol by an Heuristic State Configuration Exploration

SHU Ting;SUN Shou-qian;WANG Hai-ning;XU Wei-qiang;LI Wen-shu   

  1. (1.College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China;
    2.College of Informatics and Electronics, Zhejiang Sci-Tech University, Hangzh
    ou 310018, China)
  • Received:2009-04-14 Revised:2009-10-21 Online:2009-12-28 Published:2009-12-28
  • Contact: SHU Ting

摘要:

为避免可达性分析方法生成协议测试序列状态过程中爆炸问题的出现,提出了一种启发式探索协议状态格局空间的可执行测试序列生成算法. 该算法采用权值扩展有限状态机建模被测协议,以启发式状态格局探索策略替代传统的宽度优先搜索方式生成可执行协议测试序列;把协议可执行测试序列生成转化为在协议状态格局空间中探寻最小权值路径的问题. 实验数据表明,与宽度优先可达性分析方法相比,新算法具有较好的时空特性.

关键词: 协议一致性测试, 权值扩展有限状态机, 状态格局, 可达性分析

Abstract:

Reachability analysis, which is widely used to generate executable protocol conformance test sequences, often causes state explosion problem. To overcome the problem, a heuristic state configuration exploration method is proposed. Using a weight extend finite state machine as a protocol model, the new method employs the heuristic state configuration exploration to replace the traditional strategy of breadth-first-search. In this way, the generation of executable protocol conformance test sequences is reformulated to find the minimum weight path in the whole state configuration space of a protocol implementation under test . The experiment results show that the proposed method is superior to breadth-first-search algorithm in time and space complexity.

Key words: protocol conformance test, weight extend finite state machine, state configuration, reachability analysis